Lower Bounds for Insertion Methods for TSP
نویسنده
چکیده
We show that the random insertion method for the traveling salesman problem (TSP) may produce a tour (log log n= log log log n) times longer than the optimal tour. The lower bound holds even in the Euclidean Plane. This is in contrast to the fact that the random insertion method performs extremely well in practice. In passing we show that other insertion methods may produce tours (log n= log log n) times longer than the optimal one. No non-constant lower bounds were previously known.
منابع مشابه
On Approximation Lower Bounds for TSP with Bounded Metrics
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In particular, we prove the best known lower bound for TSP with bounded metrics for the metric bound equal to 4.
متن کاملApproximation Hardness of TSP with Bounded Metrics ( Revised
The general asymmetric TSP with triangle inequality is known to be approximable only to within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics and prove approximation lower bounds of 131=130 and 174=173, respectively, for these problems, impro...
متن کاملImproved Inapproximability Results for the Shortest Superstring and the Bounded Metric TSP
We present a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, Maximum Asymmetric TSP problem, the (1, 2)–ATSP problem, the (1, 2)–TSP problem, the (1, 4)–ATSP problem and the (1, 4)–TSP problem improving on the best up to now known approximation lower bounds for those problems.
متن کاملApproximation Hardness of TSP with Bounded Metrics
The general asymmetric TSP with triangle inequality is known to be approximable only within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics, i.e., metrics where the distances are integers between one and some upper bound B. We first prove appr...
متن کاملImproved Inapproximability Results for the Shortest Superstring and Related Problems
We develop a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, the Maximum Asymmetric TSP problem, the (1,2)–ATSP problem and the (1,2)–TSP problem improving on the best known approximation lower bounds for those problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 3 شماره
صفحات -
تاریخ انتشار 1994